261A - Maxim and Discounts - CodeForces Solution


greedy sortings *1400

Please click on ads to support us..

C++ Code:

#include<bits/stdc++.h>
using namespace std;int main(){int n,m,i,a[100005],b,x=100005,s=0;cin>>m;for(i=0;i<m;i++)cin>>b,x=min(x,b);cin>>n;for(i=0;i<n;i++)cin>>a[i];sort(a,a+n,greater<int>());for(i=0;i<n;i++)if(i%(x+2)<x)s+=a[i];cout<<s;}


Comments

Submit
0 Comments
More Questions

415. Add Strings
22. Generate Parentheses
13. Roman to Integer
2. Add Two Numbers
515. Find Largest Value in Each Tree Row
345. Reverse Vowels of a String
628. Maximum Product of Three Numbers
1526A - Mean Inequality
1526B - I Hate 1111
1881. Maximum Value after Insertion
237. Delete Node in a Linked List
27. Remove Element
39. Combination Sum
378. Kth Smallest Element in a Sorted Matrix
162. Find Peak Element
1529A - Eshag Loves Big Arrays
19. Remove Nth Node From End of List
925. Long Pressed Name
1051. Height Checker
695. Max Area of Island
402. Remove K Digits
97. Interleaving String
543. Diameter of Binary Tree
124. Binary Tree Maximum Path Sum
1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts
501A - Contest
160A- Twins
752. Open the Lock
1535A - Fair Playoff
1538F - Interesting Function